Analyzing taxonomic classification using extensible Markov models.

Visual%2Dhint Boundary to Segment Algorithm for Image Segmentation

A Data Mining Approach to Predicting Phylum for Microbial Organisms Using Genome%2DWide Sequence Data.

A Comparative Study of Outlier Detection Algorithms.

Visualization of DNA%2FRNA Structure using Temporal CGRs.

Online Mining of Risk Level of Traffic Anomalies with User%7Es Feedbacks.

Rare Event Detection in a Spatiotemporal Environment.

Efficient Mining of Emerging Events in a Dynamic Spatiotemporal Environment.

Mining Developing Trends of Dynamic Spatiotemporal Data Streams.
Abstract—This paper 1 presents an efficient modeling technique for data streams in a dynamic spatiotemporal environment and its suitability for mining developing trends. The streaming data are modeled using a data structure that interleaves a semi-unsupervised clustering algorithm with a dynamic Markov chain. The granularity of the clusters is calibrated using global constraints inherent to the data streams. Novel operations are proposed for identifying developing trends. These operations include deleting obsolete events using a sliding window scheme and identifying emerging events based on a scoring scheme derived from the synopsis obtained from the modeling process. The proposed technique is incremental, scalable, adaptive, and suitable for online processing. Algorithm analysis and experiments demonstrate the efficiency and effectiveness of the proposed technique. Index Terms—data mining, data stream, clustering, Markov chain, developing trend
Mobile Information Management%2C 24.%2D29. October 2004

Data broadcast classification.

Scalability of OAT.
this report are those of the author(s) and should not be
Mining Significant Usage Patterns from Clickstream Data.

Spatiotemporal Prediction using Data Mining Tools.

Mobilaction a mobile transaction framework supporting spatial replication and spatial consistency.

Extensible Markov Model.
Clustering streams of continuously arriving data has become an important application of data mining in recent years and efficient algorithms have been proposed by several researchers. However, clustering alone neglects the fact that data in a data stream is not only characterized by the proximity of data points which is used by clustering, but also by a temporal component. The Extensible Markov Model (EMM) adds the temporal component to data stream clustering by superimposing a dynamically adapting Markov Chain. In this paper we introduce the implementation of the R˜extension package˜rEMM which implements EMM on top of a simple clustering algorithm for data streams and discuss some examples and applications. 1
04441 Abstracts Collection %2D Mobile Information Management.

04441 Executive Summary %2D Mobile Information Management.

Information Mapping and Indexing in DAYS.

Efficient Data Mining for Maximal Frequent Subtrees.

Concurrency control performance in DAYS.

Considering Correlation between Variables to Improve Spatiotemporal Forecasting.

Improving the Web Site%27s Effectiveness by Considering Each Page%27s Temporal Information.

Semantic Caching and Query Processing.
Data Caching at local clients plays an important role in improving the performance of client-server systems. In this paper, we introduce a novel caching scheme which is called semantic caching. Unlike the traditional page caching, tuple caching etc., the semantic cache is defined and accessed based on the queries submitted by the client. Both the predicates and the resulting tuples of queries are cached. When a new query is requested, the partial or whole result may be obtained through query processing on the semantic cache. With the advantages of low overhead, efficiency and flexibility, the semantic caching scheme can be used in the mobile computing environment,heterogeneous systems and general client-server systems. The formal definition of the semantic cache and related concepts are first given in this report, we then discuss the semantic cache management issues. At last, we investigate the semantic caching query processing techniques. Keywords: Semantic Cache, Semantic Segment, Query, Query Trimming, Coalescing, Cache Replacement, Satisfiability, Implicity.
Data Mining Introductory and Advanced Topics

STIFF A Forecasting Framework For Spatio%2DTemporal Data.

A Location Dependent Benchmark with Mobility Behavior.

STIFF A Forecasting Framework For Spatio%2DTemporal Data.

STIFF A Forecasting Framework for SpatioTemporal Data.

STIFF A Forecasting Framework for SpatioTemporal Data.

TCOT%2DA Timeout%2DBased Mobile Transaction Commitment Protocol.
We present a transaction commit protocol &#034;Transaction Commit On Timeout (TCOT)&#034; based on a &#034;timeout&#034; approach for Mobile Database Systems (MDS), which can be universally used to reach a final transaction termination decision (e.g., commit, abort, etc.) in any message oriented system. Particularly suited for a wireless environment, a timeout mechanism is the only way to minimize the impact of the slow and unreliable wireless link. We compare TCOT to a modified version of 2PC to show its superiority based on commit time.
An Architecture for Location Dependent Query Processing.
As the mobility of people increases, anytime, anywhere computing has become a must. With the advances in wireless communications, the geographical position of the mobile user can be estimated accurately enough to be used to access data dependent on it. Location awareness then enables new kinds of services specific to localized information. While this provides great flexibility for the end user, it creates many challenges for the content providers and wireless operators. We propose an architecture, Location Dependent Services Manager (LDSM), between the mobile user and the service/content providers to service Location Dependent applications which access Location Dependent Data. The proposed middleware does location translation which we call Location Leveling, to adjust the location granularities and to solve the location mismatch problem. Quality of query results and the complicated queries involving more than one service provider is also supported in this middleware. In this paper, we give an overview of the proposed architecture, examine the query processing issues and discuss the future work plans.
BUC
pour l’obtention du grade de docteur ès sciences par
Interactive Clustering for Transaction Data.

Location dependent query processing.

Efficient mining of traversal patterns.

A Low%2DCost Checkpointing Technique for Distributed Databases.

Using semantic caching to manage location dependent data in mobile computing.
Location-dependent applications are becoming very popular in mobile environments. To improve system performance and facilitate disconnection, caching is crucial to such applications. In this paper, a semantic caching scheme is used to access location dependent data in mobile computing. We first develop a mobility model to represent the moving behaviors of mobile users and formally define location dependent queries. We then investigate query processing and cache management strategies. The performance of the semantic caching scheme and its replacement strategy FAR is evaluated through a simulation study. Our results show that semantic caching is more flexible and effective for use in LDD applications than page caching, whose performance is quite sensitive to the database physical organization. We also notice that the semantic cache replacement strategy FAR, which utilizes the semantic locality in terms of locations, performs robustly under different kinds of workloads.
Considering Main Memory in Mining Association Rules.
. We propose a family of large itemset counting algorithms  which adapt to the amount of main memory available. By using historical  or sampling data, the potential large itemsets (candidates) and the false  candidates are identied earlier. Redundant computation is reduced(thus  overall CPU time reduced) by counting dierent sizes of candidates together  and the use of a dynamic trie. By counting candidates earlier and  counting more candidates in each scan, the algorithms reduce the overall  number of scans required.  1 Introduction  Mining association rules has attracted a lot of interest in recent years[1, 4]. As introduced in [2], the association rule problem can be formally stated as: Let I = fi 1 ; i 2 ;    ; i m g be a set of literals called items. Let D be a set of transactions, T , where T  I . Let X  I , Y  I , and X \ Y = ; be called itemsets. An association rule, X ) Y , holds in D with confidence c if c% of the transactions in D which contain X also contain Y . The ...
Impact of Mobility on Transaction Management.
We examine the impact of mobility on three dierent options to managing mobile transactions. Using an analytic performance study we show that no one management approach is always the best and that the performance is impacted by the location management strategy used. The primary objective of this work is to illustrate that the underlying implementation strategies do indeed impact mobile transaction processing and should be considered when proposing mobile transaction processing techniques.  1 Introduction  Mobile Transactions allow users to access databases from  Mobile Units (MU) via wireless links. There have been several research studies examining dierent Mobile Transaction  (MT) models [3] and schemes to manage these MTs. Some suggest that MUs should be responsible for the management of MTs, some suggest that BSs (MSCs) should be responsible, and some propose that the management should move with the MU which requested the MT. However, there has been no investigation as to how the m...
Using Clustering for Effective Management of a Semantic Cache in Mobile Computing.
Semantic caching is particularly attractive for use in a mobile computing environment due to its content-based reasoning ability and the fact that only the required data (as opposed to a file or pages of data) is transmitted over the wireless link. In this paper we propose a cluster based approach to manage a semantic cache, aiming at examining and further making use of the semantic locality among queries in a workload. Cache replacement performance using this technique is shown to outperform that of an LRU scheme where only temporal locality is considered.
Indexing Valid Time Databases via B %2DTrees.
We present an approach named MAP21 which uses standard B  +  -trees, in a multiple disks single processor architecture, to provide efficient indexing of valid time ranges. The approach is based on mapping one dimensional ranges to one dimensional points where the lexicographical order among the ranges is preserved. We compare MAP21 to the Time Index and the R    -tree and we show that MAP21 is comparable to or outperforms those, depending on the number of trees utilized, the degree of parallelization among these and the type of query. The main contribution of this paper is to show that standard B  +  -trees, available in virtually any DBMS, can be used to provide an efficient temporal index. Although our discussion is made in terms of valid time databases, MAP21 can be used (or extended to be used) within other application domains as well. 1 Introduction  This paper deals with the problem of indexing one dimensional ranges. Assuming our domain of application to be the one of Temporal D...
Location Dependent Data and its Management in Mobile Databases.
Location Dependent Data is data whose value depends on its location. The objective of this paper is to introduce this topic and spawn further relatedresearch. 1 Introduction  In traditional ways of managing data, the relationship between the data and the geographical location of the organization it represents, is usually ignored. In wireless computing this property of #location transparency &#034; is in fact often replaced by a #location dependency &#034; property.Furthermore, the mode of issuing queries #the geographical location where the queries originate, the way they are issued, etc.# on such data determines the outcome. Location Dependent Data #LDD# refers to data whose values depend on location. The following examples illustrate these points.  Example 1 LDD - Hotel Information: Suppose a traveler wants to #nd out information #location, room rent, etc.# about hotels in the middle of his journey. He issues a query to obtain this information. The answer to this query depends upon the geograp...
Mining Association Rules Anti%2DSkew Algorithms.
Mining association rules among items in a large database has been recognized as one of the most important data mining problems. All proposed approaches for this problem require scanning the entire database at least or almost twice in the worst case. In this paper we propose several techniques which overcome the problem of data skew in the basket data. These techniques reduce the maximum number of scans to less than 2, and in most cases nd all association rules in about1scan. Our algorithms employ prior knowledge collected during the mining process and/or via sampling, to further reduce the number of candidate itemsets and identify false candidate itemsets at an earlier stage. 1
Common Subexpression Processing in Multiple%2DQuery Processing.

Using Two B %2DTrees to Efficiently Process Inclusion Spatial Queries %28Extended Abstract%29.
)  Mario A. Nascimento Margaret H. Dunham CNPTIA -- EMBRAPA CSE -- SEAS PO Box 6041 Southern Methodist University 13083--970 Campinas SP BRAZIL Dallas TX 75275--0122 USA mario@cnptia.embrapa.br mhd@seas.smu.edu ABSTRACT  In this paper we address the problem of indexing spatial data, in particular two dimensional rectangles. We propose an approach which uses two B  +  -trees, each of them indexing the projected sides of the given rectangles. The approach, which we name 2dMAP21, can also be easily parallelized. We focus on queries of the type &#034;find all rectangles included within another (reference) rectangle&#034;. We compare our approach to the R    -tree, known as the most efficient R-tree derivative. Our investigation shows that, if the queries have the same spatial distribution of the data, the non-parallel 2dMAP21 may be competitive whereas the parallelized version of 2dMAP21 outperforms the R    -tree virtually always. The use of B  +  -trees renders our approach to be practical.  1 INT...
Using Two B %2DTrees to Efficiently Process Inclusion Spatial Queries %28Extended Abstract%29.
)  Mario A. Nascimento Margaret H. Dunham CNPTIA -- EMBRAPA CSE -- SEAS PO Box 6041 Southern Methodist University 13083--970 Campinas SP BRAZIL Dallas TX 75275--0122 USA mario@cnptia.embrapa.br mhd@seas.smu.edu ABSTRACT  In this paper we address the problem of indexing spatial data, in particular two dimensional rectangles. We propose an approach which uses two B  +  -trees, each of them indexing the projected sides of the given rectangles. The approach, which we name 2dMAP21, can also be easily parallelized. We focus on queries of the type &#034;find all rectangles included within another (reference) rectangle&#034;. We compare our approach to the R    -tree, known as the most efficient R-tree derivative. Our investigation shows that, if the queries have the same spatial distribution of the data, the non-parallel 2dMAP21 may be competitive whereas the parallelized version of 2dMAP21 outperforms the R    -tree virtually always. The use of B  +  -trees renders our approach to be practical.  1 INT...
A Proposal for Indexing Bitemporal Databases via Cooperative B %2Dtrees.%2
An analogy with the way ant colonies function has suggested the definition of a new computational paradigm, which we call Ant System. We propose it as a viable new approach to stochastic combinatorial optimization. The main characteristics of this model are positive feedback, distributed computation, and the use of a constructive greedy heuristic. Positive feedback accounts for rapid discovery of good solutions, distributed computation avoids premature convergence, and the greedy heuristic helps find acceptable solutions in the early stages of the search process. We apply the proposed methodology to the classical Traveling Salesman Problem (TSP), and report simulation results. We also discuss parameter selection and the early setups of the model, and compare it with tabu search and simulated annealing using TSP. To demonstrate the robustness of the approach, we show how the Ant System (AS) can be applied to other optimization problems like the asymmetric traveling salesman, the quadrat...
A Proposal for Indexing Bitemporal Databases via Cooperative B %2Dtrees.%2
An analogy with the way ant colonies function has suggested the definition of a new computational paradigm, which we call Ant System. We propose it as a viable new approach to stochastic combinatorial optimization. The main characteristics of this model are positive feedback, distributed computation, and the use of a constructive greedy heuristic. Positive feedback accounts for rapid discovery of good solutions, distributed computation avoids premature convergence, and the greedy heuristic helps find acceptable solutions in the early stages of the search process. We apply the proposed methodology to the classical Traveling Salesman Problem (TSP), and report simulation results. We also discuss parameter selection and the early setups of the model, and compare it with tabu search and simulated annealing using TSP. To demonstrate the robustness of the approach, we show how the Ant System (AS) can be applied to other optimization problems like the asymmetric traveling salesman, the quadrat...
A Survey of Distributed Database Checkpointing.
Checkpointing a database is a vital technique to reduce the recovery time in the presence of a failure. For distributed databases, checkpointing also provides an efficient way to perform global reconstruction. However, the need for global reconstruction is infrequent in most distributed databases. In this paper, we survey and classify previous approaches for checkpointing a distributed database. We argue for a less restrictive and less resource-consuming approach to checkpoint distributed databases in an integrated distributed database system. We also argue against the use of any type of global checkpointing for a federated or multidatabase system.
A Mobile Transaction Model That Captures Both the Data and Movement Behavior.
Unlike distributed transactions, mobile transactions do not originate  and end at the same site. The implication of the movement of  such transactions is that classical atomicity, concurrency and recovery  solutions must be revisited to capture the movement behavior. As  an effort in this direction, we define a model of mobile transactions by  building on the concepts of split transactions and global transactions in  a multidatabase environment. Our view of mobile transactions, called  Kangaroo Transactions, incorporates the property that transactions in  a mobile computing system hop from one base station to another as  the mobile unit moves through cells. Our model is the first to capture  this movement behavior as well as the data behavior which reflects  the access to data located in databases throughout the static network.  The mobile behavior is dynamic and is realized in our model via the  use of split operations. The data access behavior is captured by using  the idea of global and local transactions in a multidatabase system.  This research was partially supported by the National Science Foundation under Grant Number INT-9417907 and by a Massive Digital Data System (MDDS) effort sponsored by the Advanced Research and Development Committee of the Community Management Staff. Part of this research was performed while Margaret Dunham (then Margaret Eich) was on sabbatical at the University of Queensland in Brisbane, Australia.  y  This research was partially supported by Hughes Research Laboratories under Grant Number 906356.  1  1 
M%2DIVTT An Index for Bitemporal Databases.

Segmented fuzzy checkpointing for main memory databases.
Due to little interference with other database activities, fuzzy checkpointing has been shown to be quite suitable for Main Memory Databases. This paper presents a new fuzzy checkpointing approach called Segmented Fuzzy Checkpointing (SFC), which can greatly reduce the log processing time during restart without or only slightly degrading the system performance. SFC uses a moving window to locate a more efficient  redo-point than other fuzzy checkpointing approaches. The concept of SFC is simple and flexible. Our analytical result shows that SFC speeds up the restart operation with little overhead.
Indexing a transaction%2Ddecision time database.
Although most of the research found in the temporal database literature recognizes the need to support valid time and transaction time as temporal attributes, only a few papers have recognized the role of decision (or event) time. Moreover, no indexing technique which encompasses decision time has been presented in the literature. We aim to fill this void by presenting an indexing structure that is able to index both transaction time and decision time under the same framework. This structure is based on a B  +  -tree. An extension to the proposed structure is presented to more efficiently handle the case where non-temporal data is also used in queries.  1 INTRODUCTION  The need of temporal support in databases has been well discussed [14], and most of the research has assumed the use of either valid time or transaction time as those which need to be supported by the database management system (DBMS.) A temporal database handling only transaction time is called a rollback database; one ...
Database Concurrency Control Using Data Flow Graphs.

Logging in Main Memory Databases.

From the Guest Editors %2D Special Section on Data Management Issues in Mobile Computing.

Mobile Computing and Databases Anything New%3F
A mobile computing environment involves accessing information through a wireless network connection. The mobile unit may be stationary, in motion, and/or intermittently connected to a fixed (wired) network. As technology advances are made in software and hardware, the feasibility of accessing information “anytime, anywhere ” is becoming a reality. There are similarities involved in accessing information in a multidatabase environment and mobile computing environment. We propose to superimpose a wireless-mobile computing environment on a multidatabase system to realize a system capable of effectively accessing a large amount of data over a wireless medium (MDAS — Mobile Data Access System). We show how one can easily map solutions from one environment to another. As a potentially large number of users may simultaneously access the available data, there are several issues involved in the ability to concurrently manage transactions. Current concurrency control schemes do not efficiently manage these accesses because they do not address the limited bandwidth and frequent disconnections associated with wireless networks. This paper proposes a new hierarchical concurrency control algorithm. The proposed concurrency control algorithm uses global locking tables created with semantic information contained within the hierarchy. The performance of the new algorithm is simulated and the results are presented.
A Taxonomy of Views in OODBS.

MMDB Reload Concerns.

Post%2Dcrash Log Processing for Fuzzy Checkpointing Main Memory Databases.
[37] C. Mohan and F. Levine. ARIES/IM an e cient and high concurrency index management method using write-ahead logging. In Proc. of ACM-SIGMOD Int&#039;l Conference on Management of Data,
Join Processing in Relational Databases.
The join operation is one of the fundamental relational database query operations. It facilitates the retrieval of information from two different relations based on a CartesIan product of the two relations. The Join is one of the most difficult operations to implement efficiently, as no predefine links between relations are required to exist (as
Foreword.
reference set of international guidelines and recommendations for the reporting and presentation of statistical data and metadata. Although, the Handbook was prepared primarily for short-term economic statistics, many, if not most of the recommendations presented are also relevant for annual (structural) statistics and for social and population statistics. The Handbook draws heavily on existing international statistical guidelines and recommendations that have been developed over the last twenty years by international organisations and national statistical agencies. These international standards have been developed for implementation by international organisations themselves and by national agencies in both developed and developing economies. The need for the articulation of a comprehensive set of recommendations on the reporting and presentation of statistical data and metadata is one aspect of the overall demand for improved international comparability and consistency of statistics compiled and published by national agencies and international organisations. This requirement has itself been driven by closer economic and social linkages between both the 30 OECD Member countries and between those countries and large emerging non-member economies. As discussed in the Handbook, the major causes of differences in statistics compiled in different countries flow from the use of different definitions and concepts and
Functional Completeness in Object%2DOriented Databases.

MMDB Reload Algorithms.

A transaction definition based on message passing.

Parallel Architectures for Database Systems.
Highly parallel database systems have started to replace the traditional mainframe based systems in the market because of their capability to handle large transaction processing tasks. The I/O problem has been overcome by a shared-nothing style architecture, in which the processors with private memory and disk spaces communicate only by sending messages via an intercommunication network. In such a system, the tuples of each relation in the database is partitioned among these independent processing units. Although there is consensus on the type of the architecture, there hardly is any agreement on the language paradigm to be used in developing parallel relational databases. There seem to be two dominant programming paradigms: 1. The data parallel paradigm suggests to hide the distributed structure of the memory from the user and offers a single address space and tightly synchronized processing. Even the existence of the processors is invisible to the programmer. The programmer only spec...
The Performance of Flow Graph Locking.

Main Memory Database Research Directions.

Parallel Architectures for Database Systems.
Highly parallel database systems have started to replace the traditional mainframe based systems in the market because of their capability to handle large transaction processing tasks. The I/O problem has been overcome by a shared-nothing style architecture, in which the processors with private memory and disk spaces communicate only by sending messages via an intercommunication network. In such a system, the tuples of each relation in the database is partitioned among these independent processing units. Although there is consensus on the type of the architecture, there hardly is any agreement on the language paradigm to be used in developing parallel relational databases. There seem to be two dominant programming paradigms: 1. The data parallel paradigm suggests to hide the distributed structure of the memory from the user and offers a single address space and tightly synchronized processing. Even the existence of the processors is invisible to the programmer. The programmer only spec...
Database Concurrency Control Using Data Flow Graphs.

Graph Directed Locking.

Editor%27s Notes.
Bereavement is a life transition or crisis faced by a significant number of undergraduates. Researchers have found that at any one point in time, approximately 25 percent of college students are in the first year of bereavement and almost 50 percent have experienced the death of a family member or friend within the past two years (Balk, 2001; Hardison, Neimeyer, and Lichstein, 2005). Death loss experiences and grief reactions have the potential to affect the day-to-day functioning and overall development of bereaved college students. In addition, campuses experience the deaths of members of their student body. The mortality rate for individuals between the ages of eighteen and twenty-four, when combined for both sexes and all races, is about 1 per 1,000 (Anderson and Smith, 2005). The rates are even higher for the older age groups that comprise the adult learner population (Minino and others, 2007). Despite the prevalence and significance of death issues on campus, the topics of death, grief, and bereavement are seldom addressed in the student
Editor%27s Notes.
Bereavement is a life transition or crisis faced by a significant number of undergraduates. Researchers have found that at any one point in time, approximately 25 percent of college students are in the first year of bereavement and almost 50 percent have experienced the death of a family member or friend within the past two years (Balk, 2001; Hardison, Neimeyer, and Lichstein, 2005). Death loss experiences and grief reactions have the potential to affect the day-to-day functioning and overall development of bereaved college students. In addition, campuses experience the deaths of members of their student body. The mortality rate for individuals between the ages of eighteen and twenty-four, when combined for both sexes and all races, is about 1 per 1,000 (Anderson and Smith, 2005). The rates are even higher for the older age groups that comprise the adult learner population (Minino and others, 2007). Despite the prevalence and significance of death issues on campus, the topics of death, grief, and bereavement are seldom addressed in the student
Editor%27s Notes.
Bereavement is a life transition or crisis faced by a significant number of undergraduates. Researchers have found that at any one point in time, approximately 25 percent of college students are in the first year of bereavement and almost 50 percent have experienced the death of a family member or friend within the past two years (Balk, 2001; Hardison, Neimeyer, and Lichstein, 2005). Death loss experiences and grief reactions have the potential to affect the day-to-day functioning and overall development of bereaved college students. In addition, campuses experience the deaths of members of their student body. The mortality rate for individuals between the ages of eighteen and twenty-four, when combined for both sexes and all races, is about 1 per 1,000 (Anderson and Smith, 2005). The rates are even higher for the older age groups that comprise the adult learner population (Minino and others, 2007). Despite the prevalence and significance of death issues on campus, the topics of death, grief, and bereavement are seldom addressed in the student
A Classification and Comparison of Main Memory Database Recovery Techniques.

MARS The Design of a Main Memory Database Machine.

Editor%27s Notes.
Bereavement is a life transition or crisis faced by a significant number of undergraduates. Researchers have found that at any one point in time, approximately 25 percent of college students are in the first year of bereavement and almost 50 percent have experienced the death of a family member or friend within the past two years (Balk, 2001; Hardison, Neimeyer, and Lichstein, 2005). Death loss experiences and grief reactions have the potential to affect the day-to-day functioning and overall development of bereaved college students. In addition, campuses experience the deaths of members of their student body. The mortality rate for individuals between the ages of eighteen and twenty-four, when combined for both sexes and all races, is about 1 per 1,000 (Anderson and Smith, 2005). The rates are even higher for the older age groups that comprise the adult learner population (Minino and others, 2007). Despite the prevalence and significance of death issues on campus, the topics of death, grief, and bereavement are seldom addressed in the student
Editor%27s Notes.
Bereavement is a life transition or crisis faced by a significant number of undergraduates. Researchers have found that at any one point in time, approximately 25 percent of college students are in the first year of bereavement and almost 50 percent have experienced the death of a family member or friend within the past two years (Balk, 2001; Hardison, Neimeyer, and Lichstein, 2005). Death loss experiences and grief reactions have the potential to affect the day-to-day functioning and overall development of bereaved college students. In addition, campuses experience the deaths of members of their student body. The mortality rate for individuals between the ages of eighteen and twenty-four, when combined for both sexes and all races, is about 1 per 1,000 (Anderson and Smith, 2005). The rates are even higher for the older age groups that comprise the adult learner population (Minino and others, 2007). Despite the prevalence and significance of death issues on campus, the topics of death, grief, and bereavement are seldom addressed in the student
Main Memory Database Recovery.
We present a detail performance study of three main memory recovery algorithms: Levy  and Silberschatz&#039;s Log-Driven Backups, Jagadish, Silberschatz and Sudarshan&#039;s Recovery from  Main Memory Lapses, and Kumar&#039;s Partial Recovery through simulation modeling. Our results  show that load balancing significantly affects the performance, and group commit is an effective  way to reduce disk I/O operations in main memory database systems. Jagadish, Silberschatz  and Sudarshan&#039;s algorithm, utilizing group commit and one-pass log scanning, shows desirable  performance both in normal database operations and recovery. Kumar&#039;s approach makes use  of Non-Volatile RAM (NRAM) and a set of mechanisms to manage it, which allows normal  transaction execution during system recovery. Levy and Silberschatz&#039;s algorithm lacks methods  to check the increasing in log records, making recovery time long and unpredictable.  Key Words: MMDBS, VRAM, NRAM, Shadowing, Update-in-place, Group commit.  1 
Editor%27s Notes.
Bereavement is a life transition or crisis faced by a significant number of undergraduates. Researchers have found that at any one point in time, approximately 25 percent of college students are in the first year of bereavement and almost 50 percent have experienced the death of a family member or friend within the past two years (Balk, 2001; Hardison, Neimeyer, and Lichstein, 2005). Death loss experiences and grief reactions have the potential to affect the day-to-day functioning and overall development of bereaved college students. In addition, campuses experience the deaths of members of their student body. The mortality rate for individuals between the ages of eighteen and twenty-four, when combined for both sexes and all races, is about 1 per 1,000 (Anderson and Smith, 2005). The rates are even higher for the older age groups that comprise the adult learner population (Minino and others, 2007). Despite the prevalence and significance of death issues on campus, the topics of death, grief, and bereavement are seldom addressed in the student
Editor%27s Notes.
Bereavement is a life transition or crisis faced by a significant number of undergraduates. Researchers have found that at any one point in time, approximately 25 percent of college students are in the first year of bereavement and almost 50 percent have experienced the death of a family member or friend within the past two years (Balk, 2001; Hardison, Neimeyer, and Lichstein, 2005). Death loss experiences and grief reactions have the potential to affect the day-to-day functioning and overall development of bereaved college students. In addition, campuses experience the deaths of members of their student body. The mortality rate for individuals between the ages of eighteen and twenty-four, when combined for both sexes and all races, is about 1 per 1,000 (Anderson and Smith, 2005). The rates are even higher for the older age groups that comprise the adult learner population (Minino and others, 2007). Despite the prevalence and significance of death issues on campus, the topics of death, grief, and bereavement are seldom addressed in the student
Editor%27s Notes.
Bereavement is a life transition or crisis faced by a significant number of undergraduates. Researchers have found that at any one point in time, approximately 25 percent of college students are in the first year of bereavement and almost 50 percent have experienced the death of a family member or friend within the past two years (Balk, 2001; Hardison, Neimeyer, and Lichstein, 2005). Death loss experiences and grief reactions have the potential to affect the day-to-day functioning and overall development of bereaved college students. In addition, campuses experience the deaths of members of their student body. The mortality rate for individuals between the ages of eighteen and twenty-four, when combined for both sexes and all races, is about 1 per 1,000 (Anderson and Smith, 2005). The rates are even higher for the older age groups that comprise the adult learner population (Minino and others, 2007). Despite the prevalence and significance of death issues on campus, the topics of death, grief, and bereavement are seldom addressed in the student
Transaction Oriented Performance Analysis of Database Machines.

